Scaling limit of ballistic self-avoiding walk interacting with spatial random permutations
نویسندگان
چکیده
منابع مشابه
On the scaling limit of planar self - avoiding walk
A planar self-avoiding walk (SAW) is a nearest neighbor random walk path in the square lattice with no self-intersection. A planar self-avoiding polygon (SAP) is a loop with no self-intersection. In this paper we present conjectures for the scaling limit of the uniform measures on these objects. The conjectures are based on recent results on the stochastic Loewner evolution and nondisconnecting...
متن کاملPeculiar scaling of self-avoiding walk contacts.
The nearest neighbor contacts between the two halves of an N-site lattice self-avoiding walk offer an unusual example of scaling random geometry: for N-->infinity they are strictly finite in number but their radius of gyration R(c) is power law distributed proportional to R(-tau)(c), where tau>1 is a novel exponent characterizing universal behavior. A continuum of diverging length scales is ass...
متن کاملScaling Limit of Loop-erased Random Walk
The loop-erased random walk (LERW) was first studied in 1980 by Lawler as an attempt to analyze self-avoiding walk (SAW) which provides a model for the growth of a linear polymer in a good solvent. The self-avoiding walk is simply a path on a lattice that does not visit the same site more than once. Proving things about the collection of all such paths is a formidable challenge to rigorous math...
متن کاملBallistic Phase of Self-Interacting Random Walks
We explain a unified approach to a study of ballistic phase for a large family of self-interacting random walks with a drift and self-interacting polymers with an external stretching force. The approach is based on a recent version of the OrnsteinZernike theory developed in Campanino et al. (2003, 2004, 2007). It leads to local limit results for various observables (e.g., displacement of the en...
متن کاملA Random Walk with Collapsing Bonds and Its Scaling Limit
In this note we introduce a self-interacting random walk in a dynamic random environment, prove that it is recurrent and find its scaling limit. The environment evolves in time in conjunction with the random walk and is nonmarkovian; however we will show that the walk only remembers the recent past. Various models of self-interacting random walks and random walks in dynamic random environments ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2019
ISSN: 1083-6489
DOI: 10.1214/19-ejp328